Investigations into the relationship between feedback loops and functional importance of a signal transduction network based on Boolean network modeling

<p>Abstract</p> <p>Background</p> <p>A number of studies on biological networks have been carried out to unravel the topological characteristics that can explain the functional importance of network nodes. For instance, connectivity, clustering coefficient, and shortest path length were previously proposed for this purpose. However, there is still a pressing need to investigate another topological measure that can better describe the functional importance of network nodes. In this respect, we considered a feedback loop which is ubiquitously found in various biological networks.</p> <p>Results</p> <p>We discovered that the number of feedback loops (NuFBL) is a crucial measure for evaluating the importance of a network node and verified this through a signal transduction network in the hippocampal CA1 neuron of mice as well as through generalized biological network models represented by Boolean networks. In particular, we observed that the proteins with a larger NuFBL are more likely to be essential and to evolve slowly in the hippocampal CA1 neuronal signal transduction network. Then, from extensive simulations based on the Boolean network models, we proved that a network node with the larger NuFBL is likely to be more important as the mutations of the initial state or the update rule of such a node made the network converge to a different attractor. These results led us to infer that such a strong positive correlation between the NuFBL and the importance of a network node might be an intrinsic principle of biological networks in view of network dynamics.</p> <p>Conclusion</p> <p>The presented analysis on topological characteristics of biological networks showed that the number of feedback loops is positively correlated with the functional importance of network nodes. This result also suggests the existence of unknown feedback loops around functionally important nodes in biological networks.</p

A Hybrid Technique for Medical Image Segmentation

Medical image segmentation is an essential and challenging aspect in computer-aided diagnosis and also in pattern recognition research. This paper proposes a hybrid method for magnetic resonance (MR) image segmentation. We first remove impulsive noise inherent in MR images by utilizing a vector median filter. Subsequently, Otsu thresholding is used as an initial coarse segmentation method that finds the homogeneous regions of the input image. Finally, an enhanced suppressed fuzzy c-means is used to partition brain MR images into multiple segments, which employs an optimal suppression factor for the perfect clustering in the given data set. To evaluate the robustness of the proposed approach in noisy environment, we add different types of noise and different amount of noise to T1-weighted brain MR images. Experimental results show that the proposed algorithm outperforms other FCM based algorithms in terms of segmentation accuracy for both noise-free and noise-inserted MR images

Decreased DBC1 Expression Is Associated With Poor Prognosis in Patients With Non-Muscle-Invasive Bladder Cancer

Purpose The deleted in bladder cancer 1 (DBC1) gene is located within chromosome 9 (9q32-33), a chromosomal region that frequently shows loss of heterozygosity in bladder cancer (BC). It is suspected that it acts as a tumor suppressor gene, but its prognostic value remains unclear. The aim of the present study was to investigate the value of DBC1 as a prognostic marker in BC. Materials and Methods The expression of DBC1 was determined by real-time polymerase chain reaction analysis in 344 patients with BC (220 non-muscle-invasive BC [NMIBC] and 124 muscle-invasive BC [MIBC]) and in 34 patients with normal bladder mucosa. The results were compared with clinicopathologic parameters, and the prognostic value of DBC1 was evaluated by Kaplan-Meier analysis and a multivariate Cox regression model. Results: DBC1 expression was significantly decreased in patients with MIBC compared with those diagnosed with NMIBC (p=0.010). Patients with aggressive tumor characteristics had lower DBC1 expression levels in NMIBC (each, p<0.05). By multivariate Cox regression analysis, low DBC1 expression was a predictor of progression to MIBC (hazard ratio, 7.104; p=0.013). Kaplan-Meier estimates revealed a significant difference in tumor recurrence, progression to MIBC, and cancer-specific survival depending on the level of DBC1 expression in NMIBC (log-rank test, each, p<0.05). Conclusions: The expression of DBC1 was associated with tumor aggressiveness, progression to MIBC, and survival in NMIBC. Our results suggest that DBC1 expression can be a useful prognostic marker for patients with NMIBC

Parameter optimization by using differential elimination: a general approach for introducing constraints into objective functions

<p>Abstract</p> <p>Background</p> <p>The investigation of network dynamics is a major issue in systems and synthetic biology. One of the essential steps in a dynamics investigation is the parameter estimation in the model that expresses biological phenomena. Indeed, various techniques for parameter optimization have been devised and implemented in both free and commercial software. While the computational time for parameter estimation has been greatly reduced, due to improvements in calculation algorithms and the advent of high performance computers, the accuracy of parameter estimation has not been addressed. </p> <p>Results</p> <p>We propose a new approach for parameter optimization by using differential elimination, to estimate kinetic parameter values with a high degree of accuracy. First, we utilize differential elimination, which is an algebraic approach for rewriting a system of differential equations into another equivalent system, to derive the constraints between kinetic parameters from differential equations. Second, we estimate the kinetic parameters introducing these constraints into an objective function, in addition to the error function of the square difference between the measured and estimated data, in the standard parameter optimization method. To evaluate the ability of our method, we performed a simulation study by using the objective function with and without the newly developed constraints: the parameters in two models of linear and non-linear equations, under the assumption that only one molecule in each model can be measured, were estimated by using a genetic algorithm (GA) and particle swarm optimization (PSO). As a result, the introduction of new constraints was dramatically effective: the GA and PSO with new constraints could successfully estimate the kinetic parameters in the simulated models, with a high degree of accuracy, while the conventional GA and PSO methods without them frequently failed.</p> <p>Conclusions</p> <p>The introduction of new constraints in an objective function by using differential elimination resulted in the drastic improvement of the estimation accuracy in parameter optimization methods. The performance of our approach was illustrated by simulations of the parameter optimization for two models of linear and non-linear equations, which included unmeasured molecules, by two types of optimization techniques. As a result, our method is a promising development in parameter optimization. </p

Analysis of feedback loops and robustness in network evolution based on Boolean models

<p>Abstract</p> <p>Background</p> <p>Many biological networks such as protein-protein interaction networks, signaling networks, and metabolic networks have topological characteristics of a scale-free degree distribution. Preferential attachment has been considered as the most plausible evolutionary growth model to explain this topological property. Although various studies have been undertaken to investigate the structural characteristics of a network obtained using this growth model, its dynamical characteristics have received relatively less attention.</p> <p>Results</p> <p>In this paper, we focus on the robustness of a network that is acquired during its evolutionary process. Through simulations using Boolean network models, we found that preferential attachment increases the number of coupled feedback loops in the course of network evolution. Whereas, if networks evolve to have more coupled feedback loops rather than following preferential attachment, the resulting networks are more robust than those obtained through preferential attachment, although both of them have similar degree distributions.</p> <p>Conclusion</p> <p>The presented analysis demonstrates that coupled feedback loops may play an important role in network evolution to acquire robustness. The result also provides a hint as to why various biological networks have evolved to contain a number of coupled feedback loops.</p

Differential cross section measurements for the production of a W boson in association with jets in proton–proton collisions at √s = 7 TeV

Measurements are reported of differential cross sections for the production of a W boson, which decays into a muon and a neutrino, in association with jets, as a function of several variables, including the transverse momenta (pT) and pseudorapidities of the four leading jets, the scalar sum of jet transverse momenta (HT), and the difference in azimuthal angle between the directions of each jet and the muon. The data sample of pp collisions at a centre-of-mass energy of 7 TeV was collected with the CMS detector at the LHC and corresponds to an integrated luminosity of 5.0 fb[superscript −1]. The measured cross sections are compared to predictions from Monte Carlo generators, MadGraph + pythia and sherpa, and to next-to-leading-order calculations from BlackHat + sherpa. The differential cross sections are found to be in agreement with the predictions, apart from the pT distributions of the leading jets at high pT values, the distributions of the HT at high-HT and low jet multiplicity, and the distribution of the difference in azimuthal angle between the leading jet and the muon at low values.United States. Dept. of EnergyNational Science Foundation (U.S.)Alfred P. Sloan Foundatio

Juxtaposing BTE and ATE – on the role of the European insurance industry in funding civil litigation

One of the ways in which legal services are financed, and indeed shaped, is through private insurance arrangement. Two contrasting types of legal expenses insurance contracts (LEI) seem to dominate in Europe: before the event (BTE) and after the event (ATE) legal expenses insurance. Notwithstanding institutional differences between different legal systems, BTE and ATE insurance arrangements may be instrumental if government policy is geared towards strengthening a market-oriented system of financing access to justice for individuals and business. At the same time, emphasizing the role of a private industry as a keeper of the gates to justice raises issues of accountability and transparency, not readily reconcilable with demands of competition. Moreover, multiple actors (clients, lawyers, courts, insurers) are involved, causing behavioural dynamics which are not easily predicted or influenced. Against this background, this paper looks into BTE and ATE arrangements by analysing the particularities of BTE and ATE arrangements currently available in some European jurisdictions and by painting a picture of their respective markets and legal contexts. This allows for some reflection on the performance of BTE and ATE providers as both financiers and keepers. Two issues emerge from the analysis that are worthy of some further reflection. Firstly, there is the problematic long-term sustainability of some ATE products. Secondly, the challenges faced by policymakers that would like to nudge consumers into voluntarily taking out BTE LEI

Penilaian Kinerja Keuangan Koperasi di Kabupaten Pelalawan

This paper describe development and financial performance of cooperative in District Pelalawan among 2007 - 2008. Studies on primary and secondary cooperative in 12 sub-districts. Method in this stady use performance measuring of productivity, efficiency, growth, liquidity, and solvability of cooperative. Productivity of cooperative in Pelalawan was highly but efficiency still low. Profit and income were highly, even liquidity of cooperative very high, and solvability was good